Solving Manning Optimization Issues in Ship Acquisition Programs Using Task Network Models
نویسنده
چکیده
Limitations that humans impose on task execution are rarely integrated into simulations of complex systems, often resulting in loss of outcome fidelity. In this paper we discuss how discrete-event simulation has been used to model the impact of human interactions in U.S. Navy and Coast Guard programs. These models of planned U.S. Navy and U.S. Coast Guard vessels have been used to estimate crew workload, fatigue, as well as overall system performance. In workload measuring applications detailed task networks for teams of individuals conducting ship operations have been modeled over 10 to 14-day scenarios. Predictions of operator workload along with model-generated measures of performance for several manning configurations are used to optimize manning and task allocations for the bridge and operations teams. Another model, the Total Crew Model (TCM) was developed to predict macrolevel crew capabilities. This model predicts the ability of the crew to perform all required duties and estimates fatigue for individual crewmembers. Used in combination, these models have supported HSI professionals in making manning decisions on several levels from crew size and watch team makeup to specific task allocation between watchstanders, and optimal watch rotation and crew schedules for specified mission activity over a sustained period.
منابع مشابه
Manning and Automation Model for Naval Ship Analysis and Optimization
The manning of a ship is a major driver of total ownership cost. The Government Accounting Office (GAO) states that “the cost of the ship’s crew is the largest expense incurred over the ship’s lifetime” [1]. This cost is largely determined by decisions made during concept design, which may include significant new support costs ashore. Consequently, reliable manpower estimates and related design...
متن کاملA new approach to determine efficient DMUs in DEA models using inverse optimization
This paper proposes a new approach for determining efficient DMUs in DEA models using inverse optimi-zation and without solving any LPs. It is shown that how a two-phase algorithm can be applied to detect effi-cient DMUs. It is important to compare computational performance of solving the simultaneous linear equa-tions with that of the LP, when computational issues and complexity analysis are a...
متن کاملA New Algorithm for Determining Ultimate Pit Limits Based on Network Optimization
One of the main concerns of the mining industry is to determine ultimate pit limits. Final pit is a collection of blocks, which can be removed with maximum profit while following restrictions on the slope of the mine’s walls. The size, location and final shape of an open-pit are very important in designing the location of waste dumps, stockpiles, processing plants, access roads and other surfac...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کامل